Quasiperiods of biinfinite Sturmian words

نویسندگان

  • Florian Barbero
  • Guilhem Gamard
  • Anael Grandjean
چکیده

We study the notion of quasiperiodicity, in the sense of “coverability”, for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the passage to the biinfinite case could help to prove stronger results about quasiperiods of Sturmian words. We demonstrate this by showing that all biinfinite Sturmian words have infinitely many quasiperiods, which is not quite (but almost) true in the right infinite case, and giving a characterization of those quasiperiods. The main difference between right infinite and the biinfinite words is that, in the latter case, we might have several quasiperiods of the same length. This is not possible with right infinite words because a quasiperiod has to be a prefix of the word. We study in depth the relations between quasiperiods of the same length in a given biinfinite quasiperiodic word. This study gives enough information to allow to determine the set of quasiperiods of an arbitrary word.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining Sets of Quasiperiods of Infinite Words

A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, called a quasiperiod. Based on links between quasiperiods, right special factors and square factors, we introduce a method to determine the set of quasiperiods of a given right infinite word. Then we study the structure of the sets of quasiperiods of right infinite words and, using our method, we pro...

متن کامل

Quasiperiodic and Lyndon episturmian words

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in term...

متن کامل

Biinfinite words with maximal recurrent unbordered factors

A finite non-empty word z is said to be a border of a finite non-empty word w if w = uz = zv for some non-empty words u and v. A finite non-empty word is said to be bordered if it admits a border, and it is said to be unbordered otherwise. In this paper, we give two characterizations of the biinfinite words of the form uvu, where u and v are finite words, in terms of its unbordered factors. The...

متن کامل

A Characterization of Bispecial Sturmian Words

A finite Sturmian word w over the alphabet {a, b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of s...

متن کامل

Language structure of pattern Sturmian words

Pattern Sturmian words introduced by Kamae and Zamboni KZ KZ are an analogy of Sturmian words for the maximal pattern com plexity instead of the block complexity So far two kinds of recur rent pattern Sturmian words are known namely rotation words and Toeplitz words But neither a structural characterization nor a reason able classi cation of the recurrent pattern Sturmian words is known In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018